Formalization of Polynomially Bounded and Negligible Functions Using the Computer-Aided Proof-Checking System Mizar
نویسندگان
چکیده
In recent years, formal verification applications have attracted significant attention. In particular, verification of the security of cryptosystems has been investigated extensively. In this study, we attempt to develop various mathematical libraries for cryptology using the Mizar proof checking system. Polynomially bounded and negligible functions play very important roles in cryptology. Therefore, we introduce formalized definitions of polynomially bounded and negligible functions for formalizing cryptology in Mizar.
منابع مشابه
Formal Verification of AES Using the Mizar Proof Checker
In this paper, we introduce our formalization of the Advanced Encryption Standard (AES) algorithm. AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001. We prove the correctness of our formalizati...
متن کاملFormal Verification of DES Using the Mizar Proof Checker
In this paper, we introduce our formalization of Data Encryption Standard (DES) algorithm. DES, which was formerly the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Bureau of Standards as an official Federal Information Processing Standard for the United States in 1976. We prove the correctness of our formalization by using the Mizar p...
متن کاملFormalization and Verification of Number Theoretic Algorithms Using the Mizar Proof Checker
In this paper, we introduce formalization of well-known number theoretic algorithms on the Mizar proof checking system. We formalized the Euclidean algorithm, the extended Euclidean algorithm and the algorithm computing the solution of the Chinese reminder theorem based on the source code of NZMATH which is a Python based number theory oriented calculation system. We prove the accuracy of our f...
متن کاملFormal definition of probability on finite and discrete sample space for proving security of cryptographic systems using Mizar
Security proofs for cryptographic systems are very important. The ultimate objective of our study is to prove the security of cryptographic systems using the Mizar proof checker. In this study, we formalize the probability on a finite and discrete sample space to achieve our aim. Therefore, we introduce a formalization of the probability distribution and prove the correctness of the formalizati...
متن کاملAlgebra of Polynomially Bounded Sequences and Negligible Functions
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the ...
متن کامل